Deterministic Min-Cost Matching with Delays
نویسندگان
چکیده
منابع مشابه
Min-Cost Bipartite Perfect Matching with Delays
In the min-cost bipartite perfect matching with delays (MBPMD) problem, requests arrive online at points of a finite metric space. Each request is either positive or negative and has to be matched to a request of opposite polarity. As opposed to traditional online matching problems, the algorithm does not have to serve requests as they arrive, and may choose to match them later at a cost. Our o...
متن کاملPolylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays
We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) recently introduced by Emek et al, (STOC 2016). This problem is defined on an underlying n-point metric space. An adversary presents real-time requests online at points of the metric space, and the algorithm is required to match them, possibly after keeping them waiting for some time. The cost incurred is the sum of ...
متن کاملMinimum Cost Perfect Matching with Delays for Two Sources
We study a version of the online min-cost perfect matching with delays (MPMD) problem recently introduced by Emek et al. (STOC 2016). In this problem, requests arrive in a continuous time online fashion and should be matched to each other. Each request emerges from one out of n sources, with metric inter-source distances. The algorithm is allowed to delay the matching of requests, but with a co...
متن کاملCs 598csc: Combinatorial Optimization 1 Min Cost Perfect Matching
In this lecture, we will describe a strongly polynomial time algorithm for the minimum cost perfect matching problem in a general graph. Using a simple reduction discussed in lecture 9, one can also obtain an algorithm for the maximum weight matching problem. We also note that when discussing perfect matching, without loss of generality, we can assume that all weights/costs are non-negative (wh...
متن کاملA Match in Time Saves Nine: Deterministic Online Matching With Delays
We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match them in pairs. In contrast to traditional online matching problems, in MPMD all requests appear online and an algorithm can match any pair of r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2020
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09963-7